A kernel independent fast multipole algorithm for radial basis functions
نویسنده
چکیده
We present a fast multipole algorithm for the evaluation of pairwise interaction through the radial basis functions such as 1/r, ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p and 1= ffiffiffiffiffiffiffiffiffiffiffiffiffiffi r2 þ a2 p (with a > 0) in both two and three dimensions. Our algorithm is an extension of the kernel independent fast multipole method presented in Ying et al. [L. Ying, G. Biros, D. Zorin, A kernel-independent adaptive fast multipole algorithm in two and three dimensions, J. Comput. Phys. 196(2) (2004) 591–626]. Numerical results are provided to illustrate the accuracy and complexity properties of the algorithm. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Kernel-Independent Fast Multipole Method within the framework of Regularized Stokeslets
The method of regularized Stokeslets (MRS) uses a radially symmetric blob function of infinite support to smooth point forces and allow for evaluation of the resulting flow field. This is a common method to study swimmers at zero Reynolds number where the Stokeslet is the fundamental solution corresponding to the kernel of the single layer potential. Simulating the collective motion of N micro ...
متن کاملFast multipole methods on graphics processors
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at points distributed inside a computational domain at a large number of evaluation points to a specified accuracy . The method scales as O (N) in both time and memory compared to the direct method with complexity O(N), which allows the solution of larger problems with given resources. Graphical pro...
متن کاملBiharmonic Many Body Calculations for Fast Evaluation of Radial Basis Function Interpolants in Cluster Environments
This paper discusses the scalability properties of a novel algorithm for the rapid evaluation of radial basis function interpolants. The algorithm is associated with the problem of force calculation in many-body calculations. Contrary to previously developed fast summation schemes including treecodes and fast multipole methods, this algorithm has simple communication patterns which are achieved...
متن کاملOptimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method
A fast multipole method (FMM) for asymptotically smooth kernel functions (1/r, 1/r4, Gauss and Stokes kernels, radial basis functions, etc.) based on a Chebyshev interpolation scheme has been introduced in [5]. The method has been extended to oscillatory kernels (e.g., Helmholtz kernel) in [12]. Beside its generality this FMM turns out to be favorable due to its easy implementation and its high...
متن کاملAn Empirical Interpolation based Fast Summation Method for translation invariant kernels
We derive a Fast Multipole Method (FMM) where a low-rank approximation of the kernel is obtained using the Empirical Interpolation Method (EIM). Contrary to classical interpolationbased FMM, where the interpolation points and basis are fixed beforehand, the EIM is a nonlinear approximation method which constructs interpolation points and basis which are adapted to the kernel under consideration...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Physics
دوره 213 شماره
صفحات -
تاریخ انتشار 2006